A Simpler proof of Jensen's Coding Theorem
نویسنده
چکیده
[82] provides a proof of Jensen's remarkable Coding Theorem , which demonstrates that the universe can be included in L[R] for some real R, via class forcing. The purpose of this article is to present a simpler proof of Jensen's theorem, obtained by implementing some changes first developed for the theory of strong coding (Friedman [87]). The basic idea is to first choose A ⊆ ORD so that V = L[A] and then generically add sets G α ⊆ α + , α O or an infinite cardinal (O + denotes ω) so that G α codes both G α + and A ∩ α +. Also for limit cardinals α, G α is coded by G ¯ α | ¯ α < α. Thus there are two " building blocks " for the forcing, the successor coding and the limit coding. We modify the successor coding so as to eliminate Jensen's use of " generic codes " (this improves an earlier modification of this type, due to Welch and Donder). And we thin out the limit coding so as to eliminate the technical problems causing Jensen's split into cases according to whether or not O # exists.
منابع مشابه
2 4 N ov 1 99 2 A Simpler Proof of Jensen ’ s Coding Theorem
[82] provides a proof of Jensen's remarkable Coding Theorem , which demonstrates that the universe can be included in L[R] for some real R, via class forcing. The purpose of this article is to present a simpler proof of Jensen's theorem, obtained by implementing some changes first developed for the theory of strong coding (Friedman [87]). The basic idea is to first choose A ⊆ ORD so that V = L[...
متن کاملCoding a Generic Extension of L
An easy proof is given to the corollary to Jensen's coding theorem that there exists a class-generic, non-set-generic real. Modifications to the proof allow coding certain generic extensions of L. 1. Introduction This note describes a modification of Jensen coding suitable for coding certain generic extensions of L. As an example, we shall give an elementary proof to the following consequence o...
متن کاملA simpler derivation of the coding theorem
A simple proof for the Shannon coding theorem, using only the Markov inequality, is presented. The technique is useful for didactic purposes, since it does not require many preliminaries and the information density and mutual information follow naturally in the proof. It may also be applicable to situations where typicality is not natural.
متن کاملSome results on the block numerical range
The main results of this paper are generalizations of classical results from the numerical range to the block numerical range. A different and simpler proof for the Perron-Frobenius theory on the block numerical range of an irreducible nonnegative matrix is given. In addition, the Wielandt's lemma and the Ky Fan's theorem on the block numerical range are extended.
متن کاملA new proof for the Banach-Zarecki theorem: A light on integrability and continuity
To demonstrate more visibly the close relation between thecontinuity and integrability, a new proof for the Banach-Zareckitheorem is presented on the basis of the Radon-Nikodym theoremwhich emphasizes on measure-type properties of the Lebesgueintegral. The Banach-Zarecki theorem says that a real-valuedfunction $F$ is absolutely continuous on a finite closed intervalif and only if it is continuo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 70 شماره
صفحات -
تاریخ انتشار 1994